Generating coherent state of entangled spins

A coherent state of many spins contains quantum entanglement which increases with a decrease in the collective spin value. We present a scheme to engineer this class of pure state based on incoherent spin pumping with a few collective raising/lowering operators. In a pumping scenario aimed for maximum entanglement, the steady-state of N pumped spin qubits realizes the ideal resource for the 1 to N/2 quantum telecloning. We show how the scheme can be implemented in a realistic system of atomic spin qubits in optical lattice. Error analysis show that high fidelity state engineering is possible for N ~ O(100) spins in the presence of decoherence. The scheme can also prepare a resource state for the secret sharing protocol and for the construction of large scale Affleck-Kennedy-Lieb-Tasaki (AKLT) state.Comment: updated version to appear on Phys. Rev.

Passive network tomography for erroneous networks: A network coding approach

Passive network tomography uses end-to-end observations of network communication to characterize the network, for instance to estimate the network topology and to localize random or adversarial glitches. Under the setting of linear network coding this work provides a comprehensive study of passive network tomography in the presence of network (random or adversarial) glitches. To be concrete, this work is developed along two directions: 1. Tomographic upper and lower bounds (i.e., the most adverse conditions in each problem setting under which network tomography is possible, and corresponding schemes (computationally efficient, if possible) that achieve this performance) are presented for random linear network coding (RLNC). We consider RLNC designed with common randomness, i.e., the receiver knows the random code-books all nodes. (To justify this, we show an upper bound for the problem of topology estimation in networks using RLNC without common randomness.) In this setting we present the first set of algorithms that characterize the network topology exactly. Our algorithm for topology estimation with random network errors has time complexity that is polynomial in network parameters. For the problem of network error localization given the topology information, we present the first computationally tractable algorithm to localize random errors, and prove it is computationally intractable to localize adversarial errors. 2. New network coding schemes are designed that improve the tomographic performance of RLNC while maintaining the desirable low-complexity, throughput-optimal, distributed linear network coding properties of RLNC. In particular, we design network codes based on Reed-Solomon codes so that a maximal number of adversarial errors can be localized in a computationally efficient manner even without the information of network topology.Comment: 40 pages, under submission for IEEE Trans. on Information Theor

Valley excitons in two-dimensional semiconductors

Monolayer group-VIB transition metal dichalcogenides have recently emerged as a new class of semiconductors in the two-dimensional limit. The attractive properties include: the visible range direct band gap ideal for exploring optoelectronic applications; the intriguing physics associated with spin and valley pseudospin of carriers which implies potentials for novel electronics based on these internal degrees of freedom; the exceptionally strong Coulomb interaction due to the two-dimensional geometry and the large effective masses. The physics of excitons, the bound states of electrons and holes, has been one of the most actively studied topics on these two-dimensional semiconductors, where the excitons exhibit remarkably new features due to the strong Coulomb binding, the valley degeneracy of the band edges, and the valley dependent optical selection rules for interband transitions. Here we give a brief overview of the experimental and theoretical findings on excitons in two-dimensional transition metal dichalcogenides, with focus on the novel properties associated with their valley degrees of freedom.Comment: Topical review, published online on National Science Review in Jan 201

Network Codes Resilient to Jamming and Eavesdropping

We consider the problem of communicating information over a network secretly and reliably in the presence of a hidden adversary who can eavesdrop and inject malicious errors. We provide polynomial-time, rate-optimal distributed network codes for this scenario, improving on the rates achievable in previous work. Our main contribution shows that as long as the sum of the adversary's jamming rate Zo and his eavesdropping rate Zi is less than the network capacity C, (i.e., Zo+Zi<C), our codes can communicate (with vanishingly small error probability) a single bit correctly and without leaking any information to the adversary. We then use this to design codes that allow communication at the optimal source rate of C-Zo-Zi, while keeping the communicated message secret from the adversary. Interior nodes are oblivious to the presence of adversaries and perform random linear network coding; only the source and destination need to be tweaked. In proving our results we correct an error in prior work by a subset of the authors in this work.Comment: 6 pages, to appear at IEEE NetCod 201

Distributed Reed-Solomon Codes for Simple Multiple Access Networks

We consider a simple multiple access network in which a destination node receives information from multiple sources via a set of relay nodes. Each relay node has access to a subset of the sources, and is connected to the destination by a unit capacity link. We also assume that $z$ of the relay nodes are adversarial. We propose a computationally efficient distributed coding scheme and show that it achieves the full capacity region for up to three sources. Specifically, the relay nodes encode in a distributed fashion such that the overall codewords received at the destination are codewords from a single Reed-Solomon code.Comment: 12 pages, 1 figur